import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * @Author YuanYuan
 * @Date 2022/7/25
 * @Time 9:22
 */
public class TestDemo {
    public static void Chicken() {
        Scanner scanner = new Scanner(System.in);
        Set<String> map = new HashSet<>();
        while (scanner.hasNext()) {
            String ret = scanner.next();
            map.add(ret);
        }
        System.out.println(map.size());
    }
    public static int Fib(int code) {

        int min = 1000000;
        int prior = 0;
        int next = 1;
        boolean flag = true;
        while(true) {
            int temp = next;
            next = prior+next;
            prior = temp;
            int ret = Math.abs(prior-code);
            if(ret<=min) {
                min = ret;
            }else {
                break;
            }
        }
        return min;

    }
    public static void main(String[] args) {
//        Scanner scanner = new Scanner(System.in);
//        int node = scanner.nextInt();
//        System.out.println(Fib(node));
        Chicken();
    }
}
